/*
 *  Licensed to GraphHopper GmbH under one or more contributor
 *  license agreements. See the NOTICE file distributed with this work for
 *  additional information regarding copyright ownership.
 *
 *  GraphHopper GmbH licenses this file to you under the Apache License,
 *  Version 2.0 (the "License"); you may not use this file except in
 *  compliance with the License. You may obtain a copy of the License at
 *
 *       http://www.apache.org/licenses/LICENSE-2.0
 *
 *  Unless required by applicable law or agreed to in writing, software
 *  distributed under the License is distributed on an "AS IS" BASIS,
 *  WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
 *  See the License for the specific language governing permissions and
 *  limitations under the License.
 */
package com.graphhopper.routing.util;

import com.graphhopper.storage.CHGraph;
import com.graphhopper.util.EdgeIteratorState;

public class IgnoreNodeFilter implements EdgeFilter {
    private int avoidNode;
    private CHGraph graph;
    private int maxLevel;

    public IgnoreNodeFilter(CHGraph chGraph, int maxLevel) {
        this.graph = chGraph;
        this.maxLevel = maxLevel;
    }

    public IgnoreNodeFilter setAvoidNode(int node) {
        this.avoidNode = node;
        return this;
    }

    @Override
    public final boolean accept(EdgeIteratorState iter) {
        // ignore if it is skipNode or adjNode is already contracted
        int node = iter.getAdjNode();
        return avoidNode != node && graph.getLevel(node) == maxLevel;
    }
}
